- segment tree
- 段树
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
segment tree
Look at other dictionaries:
Segment tree — In computer science, a segment tree is a tree data structure for storing intervals, or segments. It allows querying which of the stored segments contain a given point. It is, in principle, a static structure; that is, its content cannot be… … Wikipedia
Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
Tree sitting — is a form of environmentalist civil disobedience in which a protester sits in a tree, usually on a small platform built for the purpose, to protect it from being cut down (speculating that loggers will not endanger human lives by cutting an… … Wikipedia
Tree (descriptive set theory) — In descriptive set theory, a tree on a set X is a set of finite sequences of elements of X that is closed under subsequences. More formally, it is a subset T of X^{ … Wikipedia
segment — 1. A section; a part of an organ or other structure delimited naturally, artificially, or by invagination from the remainder. SYN: segmentum [TA]. SEE ALSO: metamere. 2. A territory of an organ having independent function, supply, or drainage. 3 … Medical dictionary
segment — noun /ˈsɛgmənt / (say segmuhnt) 1. one of the parts into which anything naturally separates or is naturally divided; a division or section. 2. Geometry a. a part cut off from a figure (especially a circular or a spherical one) by a line or a… …
Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… … Wikipedia
Radix tree — In computer science, a radix tree (also patricia trie or radix trie) is a space optimized trie data structure where each node with only one child is merged with its child. The result is that every internal node has at least two children. Unlike… … Wikipedia
Dancing tree — For the film Dancing tree, see Dancing tree (film) In computer science, a dancing tree is a tree data structure, which is similar to B+ tree. Invented by Hans Reiser, for use by the Reiser4 file system. As opposed to self balancing binary search… … Wikipedia
Hash tree — A binary hash tree In cryptography and computer science Hash trees or Merkle trees are a type of data structure[citation needed] which contains a tree of summary information about a larger piece of da … Wikipedia
Cover tree — The cover tree is a type of data structure in computer science that is specifically designed to facilitate the speed up of a nearest neighbor search. It is a refinement of the Navigating Net data structure, and related to a variety of other data… … Wikipedia
